全文获取类型
收费全文 | 197篇 |
免费 | 23篇 |
国内免费 | 25篇 |
专业分类
电工技术 | 7篇 |
综合类 | 25篇 |
化学工业 | 16篇 |
金属工艺 | 8篇 |
机械仪表 | 3篇 |
建筑科学 | 8篇 |
矿业工程 | 11篇 |
能源动力 | 3篇 |
轻工业 | 4篇 |
水利工程 | 2篇 |
石油天然气 | 4篇 |
武器工业 | 1篇 |
无线电 | 31篇 |
一般工业技术 | 8篇 |
冶金工业 | 6篇 |
原子能技术 | 1篇 |
自动化技术 | 107篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 10篇 |
2014年 | 13篇 |
2013年 | 18篇 |
2012年 | 16篇 |
2011年 | 17篇 |
2010年 | 12篇 |
2009年 | 6篇 |
2008年 | 13篇 |
2007年 | 16篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1982年 | 1篇 |
1974年 | 1篇 |
1955年 | 2篇 |
排序方式: 共有245条查询结果,搜索用时 15 毫秒
71.
Dobiesaw Wrblewski 《Electronic Notes in Theoretical Computer Science》2006,154(2):113-120
We consider finite connected undirected graphs without self-loops as a model of computer networks. The nodes of the graph represent computers or processors, while the edges of the graph correspond to the links between them. We present a model of distributed computations, called semi-local. This extension of the classical local model breaks the local symmetry. As a result, many useful tasks become deterministically solvable in every network assuming a very small initial knowledge about its graph representation. One of these tasks is a creation of a token in an arbitrary anonymous ring – an example of election of a leader. A semi-local solution to this problem is presented. 相似文献
72.
Gilbert G. Chen Joel W. Branch Boleslaw K. Szymanski 《Journal of Network and Systems Management》2006,14(3):359-380
There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.
相似文献
Joel W. BranchEmail: |
73.
In Mobile Ad-hoc NETwork (MANET), every node could become active dynamically. Therefore, those nodes will affect the stability of network topology because of clustering and de-clustering, and continuously make reconfiguration for the groups of network, all that will influence the overall function of network. How to choose a cluster manager to keep the stability of network topology is an important issue. In this paper, a mechanism for the designation of clustering and cluster manager is given by MANET. The mechanism is named as Unified Framework Clustering Mechanism (UFCM for short), which is a kind of processing mechanism under consideration in multi-network service, such as processing mode of initial state in the network system, processing mode of access of nodes in the group, and the processing mode concerned on failing to manage the group because the cluster manager is erroneous. Beyond that, we also propose a backup manager to take the work of the cluster manager when the cluster manager fails. 相似文献
74.
近年来,Ad Hoc网络以其方便、快捷、不受网络基础设施制约等特点得到了广泛的研究和应用。然而,在分层Ad Hoc网络进行视频信息传输的过程中,由于节点移动及网络状况等原因有可能出现簇头节点缺失的情况,影响网络的正常通信。针对分层Ad Hoc网络中高层节点移动性差这一特点设计并实现了基于分层Ad Hoc网络高层网络同步领导者选举算法,解决了上述问题。系统还引入了副主席机制,并通过实验证明,当网络中存在着上一轮选举后产生的副主席节点时,选举时间将显著缩短。算法也可应用于小型临时视频会议系统中以解决视频会议中主持人缺失及更替的问题。 相似文献
75.
76.
近年来,包含移动节点的无线传感器网络逐渐得到了广泛应用,传统的无线传感器网络路由协议已不能适用于节点移动的场景。LEACH-Mobile协议是一种较适用于移动无线传感器网络的路由协议,它在LEACH协议基础上对节点移动的处理进行了优化。本文针对移动的场景提出了一种基于移动性的无线传感器网络分簇路由协议MCR,该协议包含了一个基于移动性的簇头选举算法MCE和一个自适应LEACH-Mobile算法ALM,保证了簇头尽可能地在相对移动性最小的节点中选择,充分考虑了节点的移动性因素和剩余能量。仿真实验结果显示,MCR协议能够有效提高在移动环境下的吞吐量。 相似文献
77.
黑启动是电力系统故障后迅速恢复的重要措施之一,可减少系统事故损失,满足紧急事故备用的要求.本文对惠州抽水蓄能电站黑启动备用电源设置的必要性、可行性作分析,并根据参加黑启动所必需的厂用电负荷,计算出启动这些负荷所需的电源容量. 相似文献
78.
79.
We present a randomized self-stabilizing leader election protocol and a randomized self-stabilizing token circulation protocol
under an arbitrary scheduler on anonymous and unidirectional rings of any size. These protocols are space optimal. We also
give a formal and complete proof of these protocols. To this end, we develop a complete model for probabilistic self-stabilizing
distributed systems which clearly separates the non deterministic behavior of the scheduler from the randomized behavior of
the protocol. This framework includes all the necessary tools for proving the self- stabilization of a randomized distributed
system: definition of a probabilistic space and definition of the self-stabilization of a randomized protocol. We also propose
a new technique of scheduler management through a self-stabilizing protocol composition (cross-over composition). Roughly speaking, we force all computations to have a fairness property under any scheduler, even under an unfair one.
This work was done while Maria Gradinariu was working at LRI, Univ. Paris-Sud, CNRS. 相似文献
80.
分布式算法是用于解决多个互连处理器运行问题的算法.分布式算法的各部分并发和独立地运行,每一部分只承载有限的信息.分布式算法的异步网络模型是一个输入/输出自动机模型,节点之间靠消息传递状态和数据信息.所描述的异步网络模型是建立在图论基础上的裸异步模型.分析了分布式算法的基本算法,研究了异步网络模型建立的基本方法.在该模型之上,重点讨论了分布式波动算法中的轮询与选举算法,并用C语言模拟实现了该算法. 相似文献